Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
نویسندگان
چکیده
منابع مشابه
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
The problem of minimizing a quadratic form over the unit simplex, referred to as a standard quadratic optimization problem, admits an exact reformulation as a linear optimization problem over the convex cone of completely positive matrices. This computationally intractable cone can be approximated from the inside and from the outside by two sequences of nested polyhedral cones of increasing acc...
متن کاملOn Copositive Programming and Standard Quadratic Optimization Problems
A standard quadratic problem consists of nding global maximizers of a quadratic form over the standard simplex. In this paper, the usual semideenite programming relaxation is strengthened by replacing the cone of positive semideenite matrices by the cone of completely positive matrices (the positive semideenite matrices which allow a factorization F F T where F is some non-negative matrix). The...
متن کاملA linear programming reformulation of the standard quadratic optimization problem
The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO). It is NPhard, and contains the maximum stable set problem in graphs as a special case. In this note we show that the SQO problem may be reformulated as an (exponentially sized) linear program.
متن کاملEfficient and Cheap Bounds for (standard) Quadratic Optimization
A standard quadratic optimization problem (StQP) consists in minimizing a quadratic form over a simplex. A number of problems can be transformed into a StQP, including the general quadratic problem over a polytope and the maximum clique problem in a graph. In this paper we present several polynomial-time bounds for StQP ranging from very simple and cheap ones to more complex and tight construct...
متن کاملOn the optimization of Dombi non-linear programming
Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2015
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-015-0269-4